Gallai's conjecture for disconnected graphs
نویسندگان
چکیده
The path number p(G) of a graph G is the minimum number of paths needed to partition the edge set of G. Gallai conjectured that p(G) b n+1 2 c for every connected graph G of order n. Because of the graph consisting of disjoint triangles, the best one could hope for in the disconnected case is p(G) b 2 3 nc. We prove the sharper result that p(G) 1 2 u + b 2 3 gc where u is the number of odd vertices and g is the number of nonisolated even vertices.
منابع مشابه
Gallai's path decomposition conjecture for graphs of small maximum degree
Gallai’s path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most n+1 2 paths. We confirm that conjecture for all graphs with maximum degree at most five.
متن کاملGallai's path decomposition conjecture for triangle-free planar graphs
A path decomposition of a graph G is a collection of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph on n vertices admits a path decomposition of cardinality at most ⌊(n + 1)/2⌋. Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex wi...
متن کاملOn Gallai's conjecture for series-parallel graphs and planar 3-trees
A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected n-vertex graph has a path cover with at most dn/2e paths. We prove Gallai’s conjecture for series-parallel graphs. For the class of planar 3-trees we show how to construct a path cover with at most b5n/8c paths, which is an improvement over the best previously known b...
متن کاملReconstruction of p-disconnected graphs
We prove that Kelly-Ulam conjecture is true for p-disconnected graphs.
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 213 شماره
صفحات -
تاریخ انتشار 2000